Bookmark-Coloring Algorithm for Personalized PageRank Computing
نویسنده
چکیده
We introduce a novel bookmark-coloring algorithm (BCA) that computes authority weights over the web pages utilizing the web hyperlink structure. The computed vector (BCV) is similar to the PageRank vector defined for a page-specific teleportation. Meanwhile, BCA is very fast, and BCV is sparse. BCA also has important algebraic properties. If several BCVs corresponding to a set of pages (called hub) are known, they can be leveraged in computing arbitrary BCV via a straightforward algebraic process and hub BCVs can be efficiently computed and encoded.
منابع مشابه
Bookmark-Coloring Approach to Personalized PageRank Computing
Below we introduce a novel bookmark-coloring algorithm (BCA) that computes authority weights over the Web pages utilizing the Web hyperlink structure. The computed vector (BCV) is similar to the PageRank vector defined for a page-specific teleportation. Meanwhile, BCA is very fast and BCV is sparse. BCA also has important algebraic properties. If several BCVs corresponding to a set of pages (ca...
متن کاملFast Algorithm for Top-k Personalized PageRank Queries with Layered Graphs
In recent years, an efficient method of performing analyses and computations on graph networks, regarding recent and up-to-date data, has been needed due to continuous growth of datasets. Personalized PageRank is one of the most well-known computation methods for graphs. Personalized PageRank computes the relative importance or relevance with respect to a set of given nodes, called start nodes ...
متن کاملCommunity Detection Using Time-Dependent Personalized PageRank
Local graph diffusions have proven to be valuable tools for solving various graph clustering problems. As such, there has been much interest recently in efficient local algorithms for computing them. We present an efficient local algorithm for approximating a graph diffusion that generalizes both the celebrated personalized PageRank and its recent competitor/companion the heat kernel. Our algor...
متن کاملPROS: A Personalized Ranking Platform for Web Search
Current search engines rely on centralized page ranking algorithms which compute page rank values as single (global) values for each Web page. Recent work on topic-sensitive PageRank [6] and personalized PageRank [8] has explored how to extend PageRank values with personalization aspects. To achieve personalization, these algorithms need specific input: [8] for example needs a set of personaliz...
متن کاملRandom Walks with Random Projections
Random projections have been widely used for dimensionality reduction of high dimensional problems. In this paper we show how to compute some popular random walk based proximity measures (hitting and commute times, personalized pagerank) using random projections in undirected graphs. A number of important graph-based real world applications such as image segmentation, collaborative filtering in...
متن کامل